The asymptotic average degree of an augmented polynomial
نویسندگان
چکیده
منابع مشابه
The Asymptotic Average Degree of an Augmented Polynomial
The interest in self-reciprocal polynomials in coding theory originated with Massey (1963, 1964), who has shown tha t whenever a self-reciprocal polynomial is used as a convolutional code-generating polynomial, the resulting code may be decoded backward us well as forward, with the same hardware and the same probabil i ty of decoding error. Let G( D ) = go 4glD 4g~D ~ 4" . . 4g , D ' , where n ...
متن کاملAverage Degree-Eccentricity Energy of Graphs
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولAn average-case asymptotic analysis of the Container Relocation Problem
The Container Relocation Problem (CRP) involves finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers in a given order. In this paper, we focus on average case analysis of the CRP when the number of columns grows asymptotically. We show that the expected minimum number of relocations converges to a simple and intuitive lower-bound f...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1968
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(68)90145-9